DESCRIPTIVE POWER OF FLOW EXPRESSIONS AND EVENT EXPRESSIONSARAKI T; TSUJINO Y; TOKURA N et al.1980; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1980; VOL. 11; NO 4; PP. 76-83; BIBL. 11 REF.Article

A PARALLEL HETERARCHICAL MACHINE FOR HIGH LEVEL LANGUAGE PROCESSINGGUZMAN A.1981; INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING/1981/BELLAIRE OH; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1981; PP. 64-71; BIBL. 14 REF.Conference Paper

A FORMAL SYSTEM FOR PARALLEL PROGRAMS IN DISCRETE TIME AND SPACEKAWAI H.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 156-165; BIBL. 15 REF.Conference Paper

EINE IMPLEMENTATION DES MONITORKONZEPTES = UNE IMPLEMENTATION D'UNE CONCEPTION DE MONITEURGERSTENBERGER M.1982; WISSENSCHAFT. Z. TECH. HOCHSCH. KARL-MARX-STADT.; ISSN 0372-7610; DDR; DA. 1982; VOL. 24; NO 3; PP. 277-283; BIBL. 9 REF.Article

DESIGN AND DEVELOPMENT OF CONCURRENT PROGRAMSJULLIAND J; PERRIN GR.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 111; PP. 464-479; BIBL. 14 REF.Conference Paper

DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGICCLARKE EM; EMERSON EA.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 52-71; BIBL. 18 REF.Conference Paper

PROOF RULES DEALING WITH FAIRNESSAPT K; OLDEROG ER.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 1-8; BIBL. 3 REF.Conference Paper

RECURSIVE ASSERTIONS AND PARALLEL PROGRAMSAPT KR.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 15; NO 3; PP. 219-232; BIBL. 8 REF.Article

TEMPORAL LOGIC CAN BE MORE EXPRESSIVEWOLPER P.1981; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE. 22/1981/NASHVILLE TN; USA; NEW YORK: INSTITUTE OF ELECTRICAL & ELECTRONICS ENGINEERS; DA. 1981; PP. 340-348; BIBL. 11 REF.Conference Paper

PROOF OF A CONCURRENT PROGRAM FINDING EULER PATHSBEST E.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 88; PP. 142-153; BIBL. 6 REF.Conference Paper

RELATIONAL SEMANTICS OF STRONGLY COMMUNICATING SEQUENTIAL PROCESSESGUERREIRO P.1980; MATH. APPL. INFORMAT., RAPP. RECH.; FRA; DA. 1980; NO 200; 19 P.; ABS. FRE; BIBL. 2 P.Serial Issue

SIMUL 4, EIN SIMULATOR ZUM ENTWICKELN UND TESTEN VON SMS-PARALLELRECHNERPROGRAMMEN = SIMUL 4: UN SIMULATEUR POUR DEVELOPPER ET TESTER LES PROGRAMMES PARALLELES SMSHORNEBER EH.1980; SIEMENS FORSCH.- U. ENTWICKL.-BER.; DEU; DA. 1980; VOL. 9; NO 1; PP. 8-10; BIBL. 8 REF.Article

ARE INFINITE BEHAVIOURS OF PARALLEL SYSTEM SCHEMATA NECESSARY.CZAJA L.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 148; PP. 108-117; BIBL. 4 REF.Conference Paper

LARGE SCALE SCIENTIFIC COMPUTING: FUTURE DIRECTIONSPATTERSON GS JR.1982; COMPUT. PHYS. COMMUN.; ISSN 0010-4655; NLD; DA. 1982; VOL. 26; NO 3-4; PP. 217-225; BIBL. 17 REF.Conference Paper

POINTER VARIABLES IN CONCURRENT PASCALRAVN AP.1982; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1982; VOL. 12; NO 3; PP. 211-222; BIBL. 10 REF.Article

VERIFYING CONCURRENT PROCESSES USING TEMPORAL LOGICHAILPERN BT.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; NO 129; PP. 1-208; BIBL. 49 REF.Article

LIVELOCKS IN PARALLEL PROGRAMSKWONG YS.1981; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1981; VOL. 10; NO 2; PP. 121-135; BIBL. 14 REF.Article

SYNTHESIS OF COMMUNICATING PROCESSES FROM TEMPORAL LOGIC SPECIFICATIONSMANNA Z; WOLPER P.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 253-281; BIBL. 14 REF.Conference Paper

ANALYTICAL MODELS TO EXPLAIN ANOMALOUS BEHAVIOR OF PARALLEL ALGORITHMSWEIDE BW.1981; INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING/1981/BELLAIRE OH; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1981; PP. 183-187; BIBL. 10 REF.Conference Paper

A MACHINE-LEVEL SEMANTICS FOR NONDETERMINISTIC, PARALLEL PROGRAMSBENSON D.1982; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1982; NO 137; PP. 15-25; BIBL. 12 REF.Conference Paper

IMPARTIALITY, JUSTICE AND FAIRNESS: THE ETHICS OF CONCURRENT TERMINATIONLEHMANN D; PNUELI A; STAVI J et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 264-277; BIBL. 7 REF.Conference Paper

PROGRAM LOGICS AND PROGRAM VERIFICATIONLAMPORT L; OWICKI S.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 197-199; BIBL. 4 REF.Conference Paper

VERIFICATION OF CONCURRENT PROGRAMS: TEMPORAL PROOF PRINCIPLESMANNA Z; PNUELI A.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981 PUBL. 1982; NO 131; PP. 200-252; BIBL. 16 REF.Conference Paper

TRANSFORMATIONAL SEMANTICS FOR CONCURRENT PROGRAMSBROY M.1980; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1980; VOL. 11; NO 2; PP. 87-91; BIBL. 11 REF.Article

ON SOME PARALLEL PROGRAMMING TECHNIQUESLIPOVSKI GJ.1978; COMPSAC 78. INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE. 2/1978-11-13/CHICAGO; USA; NEW YORK: IEEE; DA. 1978; 781-789; BIBL. 28 REF.Conference Paper